Extensions of the WFS Semantics for Logic Programming
نویسندگان
چکیده
WFS and STABLE are the two most well known non monotonic semantics for logic programming. We introduce WFS ext1 and WFS ext2 , which are non monotonic semantics for function free normal programs. The suitable properties of these semantics are that they extend WFS by allowing a weak form of reasoning by cases, are rational and also polynomial-time computable. We also introduce C-WE , an extension of WFS ext2 that incorpores a strong form of reasoning by cases and is close to STABLE. Yet, C-WE appears to have a better behavior than STABLE.
منابع مشابه
Strong Negation in Well-Founded and Partial Stable Semantics for Logic Programs
A formalism called partial equilibrium logic (PEL) has recently been proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. In PEL one defines a class of minimal models, called partial equilibrium models, in a non-classical logic, HT . On logic programs partial equilibrium models coincide with Przymusinski’s partial stable (p-stable) models, so that PEL can be ...
متن کاملSemantics of (disjunctive) Logic Programs Based on Partial Evaluation
We present a new and general approach for deening, understanding, and computing logic programming semantics. We consider disjunctive programs for generality, but our results are still interesting if specialized to normal programs. Our framework consists of two parts: (1) a semantical, where semantics are deened in an abstract way as the weakest semantics satisfying certain properties, and (2) a...
متن کاملA Well-Founded Semantics with Disjunction
In this paper we develop a new semantics for disjunctive logic programs, called Well-Founded Semantics with Disjunction (WFSd), by resorting to a fixed point-based operator. Coinciding with the WellFounded Semantics (WFS) for normal logic programs, our semantics is uniquely defined for every disjunctive logic program. By exploring examples, we show WFSd does not agree with any other semantics w...
متن کاملEquality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In particular, we provide a well-founded semantics (WFS) for the recent Datalog± family of ontology languages, which covers several important description logics (DLs). To do so, we generalize Datalog± by non-stratified nonmonotonic ne...
متن کاملWell-Founded Inference and 3-Valued Logics
We deene a simple logical semantics based on minimal models in Lukasiewicz's 3-valued logic, L 3. On normal logic programs it is equivalent to the well-founded semantics (WFS), and on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusinski's 3-valued stable semantics. One advantage is that it is char-acterised by simple conditions on mo...
متن کامل